Perfect hexagon triple systems

Embedding Steiner triple systems in hexagon triple systems

Perfect dexagon triple systems

We completely determine the spectrum for perfect dexagon triple systems. © 2007 Elsevier B.V. All rights reserved.

The Triangle Intersection Problem For Hexagon Triple Systems

Perfect countably infinite Steiner triple systems

We use a free construction to prove the existence of perfect Steiner triple systems on a countably infinite point set. We use a specific countably infinite family of partial Steiner triple systems to start the construction, thus yielding 2א0 non-isomorphic perfect systems.

Some new perfect Steiner triple systems

In a Steiner triple system STS(v)=(V,B), for each pair {a, b} ⊂ V , the cycle graph Ga,b can be defined as follows. The vertices of Ga,b are V \{a, b, c} where {a, b, c} ∈ B. {x, y} is an edge if either {a, x, y} or {b, x, y} ∈ B. The Steiner triple system is said to be perfect if the cycle graph of every pair is a single (v − 3)-cycle. Perfect STS(v) are known only for v = 7, 9, 25 and 33. We ...